Перевод: с английского на все языки

со всех языков на английский

search criterion

См. также в других словарях:

  • Criterion of multiple attestation — Criterion of multiple attestation: Last Supper The criterion of multiple attestation or independent attestation is a tool used by Biblical scholars to help determine whether certain actions or sayings by Jesus in the New Testament are from… …   Wikipedia

  • Index (search engine) — Search engine indexing collects, parses, and stores data to facilitate fast and accurate information retrieval. Index design incorporates interdisciplinary concepts from linguistics, cognitive psychology, mathematics, informatics, physics, and… …   Wikipedia

  • Local search (optimization) — In computer science, local search is a metaheuristic for solving computationally hard optimization problems. Local search can be used on problems that can be formulated as finding a solution maximizing a criterion among a number of candidate… …   Wikipedia

  • Tabu search — is a mathematical optimization method, belonging to the class of local search techniques. Tabu search enhances the performance of a local search method by using memory structures: once a potential solution has been determined, it is marked as… …   Wikipedia

  • Object categorization from image search — In computer vision, the problem of object categorization from image search is the problem of training a classifier to recognize categories of objects, using only the images retrieved automatically with an Internet search engine. Ideally,… …   Wikipedia

  • Guided Local Search — is a metaheuristic search method. A meta heuristic method is a method that sits on top of a local search algorithm to change its behaviour. Guided Local Search builds up penalties during a search. It uses penalties to help local search algorithms …   Wikipedia

  • Cuckoo search — (CS) is an optimization algorithm developed by Xin she Yang and Suash Deb in 2009.[1][2] It was inspired by the obligate brood parasitism of some cuckoo species by laying their eggs in the nests of other host birds (of other species). Some host… …   Wikipedia

  • Fraysseix–Rosenstiehl's planarity criterion — In graph theory, a branch of mathematics, Fraysseix–Rosenstiehl s planarity criterion is a characterization of planarity based on the properties of the tree defined by a depth first search. Considering any depth first search of a graph G , the… …   Wikipedia

  • Beam search — is a heuristic search algorithm that is an optimization of best first search that reduces its memory requirement. Best first search is a graph search which orders all partial solutions (states) according to some heuristic which attempts to… …   Wikipedia

  • Reactive search — is the common name for a family of optimization algorithms based on the local search techniques. It refers to a class of heuristics that automatically adjust their working parameters during the optimization phase.OverviewReactive search, like all …   Wikipedia

  • Quiescence search — is an algorithm typically used to evaluate minimax game trees in game playing computer programs. It is a remedy for the horizon problem faced by AI engines for various games like chess and Go.The horizon effectThe horizon effect is a problem in… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»